One-Way Hash Functions With Changeable Parameters

نویسندگان

  • Tsu-Miin Hsieh
  • Yi-Shiung Yeh
  • Chu-Hsing Lin
  • Ssu-Heng Tuan
چکیده

In this paper, four new algorithms for improvements of MD5 and SHA-Keyed/Unkeyed MD5 and Keyed/Unkeyed SHA are proposed. We change the mode of ®xed retrieval of the parameters to that of dynamic retrieval of the parameters by applying a mapping between the index phrase and the parameter table. As shown in the experimental result, with 1% degradation of performance, comparing to the original algorithms, dynamic retrieval of parameters can be achieved. We believe that the security can be increased under the improvements. Ó 1999 Elsevier Science Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collision Analysis and Improvement of a Parallel Hash Function based on Chaotic Maps with Changeable Parameters

Recently, a parallel hash function based on chaotic maps with changeable parameters was proposed by Li et al (2011, pp.1305-1312). In this paper, the security of it is analyzed and the weakness of the architecture is pointed out. It is found that the main limitations are the error using of floor, round and exclusive OR operations in the algorithm. In order to counterstrike these, some improveme...

متن کامل

A NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA

In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...

متن کامل

Optimal hash functions for approximate closest pairs on the n-cube

One way to find closest pairs in large datasets is to use hash functions [6], [12]. In recent years locality-sensitive hash functions for various metrics have been given: projecting an n-cube onto k bits is simple hash function that performs well. In this paper we investigate alternatives to projection. For various parameters hash functions given by complete decoding algorithms for codes work b...

متن کامل

Connections among Several Versions of One-way Hash Functions 1

We study the following two kinds of one-way hash functions: universal one-way hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former is that given an initial-string x, it is computationally diicult to nd a diierent string y that collides with x. And the main property of the latter is that it is computationally diicult to nd a pair x 6 = y of strin...

متن کامل

Provably Secure One-Way Hash Functions

This paper surveys recent progress on the construction of provably secure one-way hash functions, under gradually weakened assumptions. One-way hash functions have many cryptographic applications. In digital signatures, they are used to compress long input strings prior to actual signing procedures. This usually greatly improves the overall efficiency of a signature scheme. They are also used t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Sci.

دوره 118  شماره 

صفحات  -

تاریخ انتشار 1999